Low Complexity Fair Scheduling in LTE/LTE-A Uplink Involving Multiple Traffic Classes

The bulk of the research on long term evolution/long evolution-advanced [(LTE)/(LTE-A)] packet scheduling is concentrated in downlink and uplink comparatively less explored. In uplink, channel aware with throughput maximization has been widely studied while considering an infinitely backlogged buffer model, which makes investigations unrealistic. Therefore, we propose optimal procedure realistic traffic sources. First, advocate a joint algorithm, maximizes actual transmitted bit-count. Thereafter, introduce delay constraints our algorithm to support real-time traffic. We further enhance by incorporating varied requirements demanded mixed classes. Finally, priority flipping minimize bandwidth starvation lower presence higher percentage high observe that constraint may render optimization-based proposals infeasible. avoid infeasibility, replace outage minimization (DOM). DOM aims at minimizing drop due violation. Moreover, also helps reducing problems well-known assignment problem, can be solved applying Hungarian algorithm. Hence, approach delivers allocation low computational complexity.